2-Stripes Block-Circulant LDPC Codes for Single Bursts Correction

نویسندگان

  • E. A. Krouk
  • Andrei Ovchinnikov
چکیده

In this paper the low-density parity-check (LDPC) codes are considered applied to correction of error bursts. Errors grouping and forming of so-called bursts are typical effect in real communication and data storage systems, however, this effect is typically ignored, and the coding task is reduced to correction of independent errors, which makes the practical characteristics of coding systems worse comparing to possibly reachable. Nevertheless, LDPC codes are able to protect from burst errors as well as independent ones. The main result of the paper is dedicated to evaluation of maximum correctable burst length of Gilbert codes, which are the 2-stripes special case of LDPC block-permutation codes, the construction which is often used in modern practical applications and research.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Memory Efficient -Fully Parallel QC-LDPC Encoder

Low-Density Parity Check codes are a special class of linear block codes widely used in communication and disk storage systems, due to their Shannon limit approaching performance and their favourable structure. A special class of LDPC codes, called QC-LDPC codes, allows for efficient hardware implementations of encoding and decoding algorithms by exploiting the structure of the Parity Check Mat...

متن کامل

Design of Generalized LDPC Codes and their Decoders

We first consider the design of generalized LPDC (G-LDPC) codes with recursive systematic convolutional (RSC) constraint nodes in place of the standard single parity check constraint nodes. Because rate-1/2 RSC nodes lead to low-rate G-LDPC codes, we consider high-rate tail-biting RSC nodes for which Riedel’s APP-decoder based on the reciprocal-dual code trellis becomes necessary. We present th...

متن کامل

Structuredquasi - cyclicLDPCcodeswith girth 18 and column - weight J 3

A class of maximum-girth geometrically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes with columnweight J 3 is presented. The method is based on the slope concept between two circulant permutation matrices and the concept of slope matrices. A LDPC code presented by a mv ×ml parity-check matrix H , consisting of m ×m matrices each of which is either a circulant permutation ma...

متن کامل

On the Usage of LDPC Codes in the McEliece Cryptosystem

In this paper, a new variant of the McEliece cryptosystem, based on Low-Density Parity-Check (LDPC) codes, is studied. Random-based techniques allow to design large families of LDPC codes with equivalent error correction capability; therefore, in principle, such codes can substitute Goppa codes, originally used by McEliece in his cryptosystem. Furthermore, Quasi-Cyclic (QC) LDPC codes can be ad...

متن کامل

Construction and Performance Analysis of BIBD-QC-LDPC Codes for Correcting Erasure-Bursts

This paper presents a novel approach for constructing structured regular QC-LDPC codes based on a special type of combinatorial designs,known as the balanced incomplete block design (BIBD).The code design approach based on the technology of block cyclic shift and dispertion (BCSD) for correcting erasure-bursts over the binary bursts erasure channel (BBEC). Furthermore, the Tanner graph of the c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016